Minimum-time running: a numerical approach.
نویسندگان
چکیده
The article deals with the minimum-time running problem. The time of covering a given distance is minimized. The Hill-Keller model of running employed is based on Newton's second law and the equation of power balance. The problem is formulated in optimal control. The unknown function is the runner's velocity that varies with the distance. The problem is solved applying the direct Chebyshev's pseudospectral method.
منابع مشابه
Simultaneous Allocation Of Reliability & Redundancy Using Minimum Total Cost Of Ownership Approach
This paper addresses the mixed integer reliability redundancy allocation problems to determine simultaneous allocation of optimal reliability and redundancy level of components based on three objective goals. System engineering principles suggest that the best design is the design that maximizes the system operational effectiveness and at the same time minimizes the total cost of ownership (TCO...
متن کاملDistributed Kalman filtering with minimum-time consensus algorithm
Fueled by applications in sensor networks, these years have witnessed a surge of interest in distributed estimation and filtering. A new approach is hereby proposed for the Distributed Kalman Filter (DKF) by integrating a local covariance computation scheme. Compared to existing well-established DKF methods, the virtue of the present approach lies in accelerating the convergence of the state es...
متن کاملA New Approach to Knock - Knee Channel RoutingDorothea
We present a new channel routing algorithm in the knock-knee mode that produces for dense problems area-optimal layouts with minimum total wire length and O(n) bends (n number of nets), where the total number of bends is at most d ? 2 (d density) more than the minimum. The running time is O(n). It thus improves the algorithm in 3] that determines area-optimal layouts with minimum total wire len...
متن کاملRectilinear Path Problems among Rectilinear Obstacles Revisited
We present eecient algorithms for nding rectilinear collision-free paths between two given points among a set of rectilinear obstacles. Our results improve the time complexity of previous results for nding the shortest rectilinear path, the minimum-bend shortest rectilinear path, the shortest minimum-bend rectilinear path and the minimum-cost rectilinear path. For nding the shortest rectilinear...
متن کاملON THE STATIONARY PROBABILITY DENSITY FUNCTION OF BILINEAR TIME SERIES MODELS: A NUMERICAL APPROACH
In this paper, we show that the Chapman-Kolmogorov formula could be used as a recursive formula for computing the m-step-ahead conditional density of a Markov bilinear model. The stationary marginal probability density function of the model may be approximated by the m-step-ahead conditional density for sufficiently large m.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Acta of bioengineering and biomechanics
دوره 13 2 شماره
صفحات -
تاریخ انتشار 2011